#define _CRT_SECURE_NO_WARNINGS  1


class Solution {
public:
    int findMin(vector<int>& nums)
    {
        int left = 0, right = nums.size() - 1;
        while (left < right)
        {
            int mid = left + (right - left) / 2;
            if (nums[mid] >= nums[0])
                left = mid + 1;
            else
                right = mid;
        }
        if (nums[nums.size() - 1] > nums[0])
            return nums[0];
        return nums[left];
    }
};
